Rainbow Turán number of clique subdivisions
نویسندگان
چکیده
We show that for any integer t?2, every properly edge-coloured graph on n vertices with more than n1+o(1) edges contains a rainbow subdivision of Kt. Note this bound the number is sharp up to o(1) error term. This analogue some classical results clique subdivisions and extends Turán numbers. Our method relies framework introduced by Sudakov Tomon (2022) which we adapt find robust expanders in coloured setting.
منابع مشابه
Rainbow Turán Problems
For a fixed graph H, we define the rainbow Turán number ex∗(n,H) to be the maximum number of edges in a graph on n vertices that has a proper edge-colouring with no rainbow H. Recall that the (ordinary) Turán number ex(n,H) is the maximum number of edges in a graph on n vertices that does not contain a copy of H. For any non-bipartite H we show that ex∗(n,H) = (1+o(1))ex(n,H), and if H is colou...
متن کاملArrangeability and Clique Subdivisions
Let k be an integer. A graph G is k-arrangeable (concept introduced by Chen and Schelp) if the vertices of G can be numbered v1, v2, . . . , vn in such a way that for every integer i with 1 ≤ i ≤ n, at most k vertices among {v1, v2, . . . , vi} have a neighbor v ∈ {vi+1, vi+2, . . . , vn} that is adjacent to vi. We prove that for every integer p ≥ 1, if a graph G is not p arrangeable, then it c...
متن کاملGreedy clique decompositions and the Turán numbers
an Numbers Sean McGuinness University of Ume a September, 1994 Abstract. In this paper, we show that for p 4 if C is a clique decomposition obtained by removing maximal cliques(ie. their edges) of order at least p one by one until none remain, in which case the remaining edges are removed one by one, then the sum of the orders of the cliques in C is at most 2tp 1(n): Here tp 1(n) denotes the nu...
متن کاملChromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
For a graph G, let χ(G) denote its chromatic number and σ(G) denote the order of the largest clique subdivision in G. Let H(n) be the maximum of χ(G)/σ(G) over all n-vertex graphs G. A famous conjecture of Hajós from 1961 states that σ(G) ≥ χ(G) for every graph G. That is, H(n) ≤ 1 for all positive integers n. This conjecture was disproved by Catlin in 1979. Erdős and Fajtlowicz further showed ...
متن کاملRainbow Turán problem for even cycles
An edge-colored graph is rainbow if all its edges are colored with distinct colors. For a fixed graph H , the rainbow Turán number ex(n,H) is defined as themaximumnumber of edges in a properly edge-colored graph on n vertices with no rainbow copy of H . We study the rainbow Turán number of even cycles, and prove that for every fixed ε > 0, there is a constant C(ε) such that every properly edge-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2023
ISSN: ['1095-9971', '0195-6698']
DOI: https://doi.org/10.1016/j.ejc.2022.103675